Social Networks: Analysis and Case Studies by Şule Gündüz-Öğüdücü & A. Şima Etaner-Uyar

Author:Şule Gündüz-Öğüdücü & A. Şima Etaner-Uyar
Language: eng
Format: epub
Publisher: Springer Vienna, Vienna

(19)

where C in is the number of internal connections of C, i.e. the number of links having both endpoints in C, is higher than a threshold τ(C) defined as

(20)

where

(21)

The local communities are then merged provided that their overlapping score is higher than a value given as input parameter. The second phase adaptively updates the communities obtained in the first step, by considering how the network evolves over time. The authors individuate four major changes a network can incur: a new node and its adjacent edges are either added or removed to/from the network; a new edge connecting two existing nodes is added or an existing edge is removed. The algorithm is able to obtain the new community structure by adopting the more apt strategy to determine whether a community will split, or two communities will merge. A comparison with existing approaches showed that AFOCS performances are competitive with other methods, mainly as regards running time.

Table 1A summarization of the reviewed methods. For EAGLE, h is the number of pairs of maximal cliques which are neighbors, and s is the number of maximal cliques; for GCE, h is the number of cliques; for Ahn and AFOCS, d max is the maximum node degree; for GA-NET+ t is the number of generations and p the population size; for SLPA t is the number of iterations performed by the algorithm

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.